Method and device for scheduling, generating and processing a document comprising blocks of information

ABSTRACT

A method of scheduling a document comprising juxtaposed information blocks, comprises a step (E 11 ) of dividing the information blocks into two groups, a first group (V) comprising information blocks that can be processed on the fly, and a second group (NV) comprising the information blocks of the document not in the first group; of inserting (E 13 ) the second group (NV) of information blocks; of inserting (E 14 ) a signaling block; and of inserting (E 15 ) the first group (V) of information blocks after the signaling block. This scheduling method is useful especially in order to optimize the on-the-fly processing of a document in XML language.

[0001] The present invention relates to a method of processing a document comprising blocks of information.

[0002] It also relates to a method for scheduling such a document before processing and a method for generating such a document.

[0003] It correspondingly relates to a scheduling device, a generation device and a processing device which are adapted respectively for implementing the scheduling and processing methods in accordance with the invention.

[0004] It also relates to a method of creating a document comprising juxtaposed information blocks.

[0005] In general terms, this invention applies to communications networks in which the exchanges between computers and other devices communicating with the network are implemented by means of transfer of documents represented in a markup language of the extensible Markup Language (XML) type.

[0006] The XML language is a markup language, that is to say a language which presents information framed by tags.

[0007] It is defined through a W3C standard. The latter defines both the structure of the document represented in XML language and rules for processing this document.

[0008] Thus, in the SOAP standard defined by the W3C standard, a document in XML language is regarded as a document comprising juxtaposed blocks of information.

[0009] A detailed description of this SOAP standard can be consulted on the Internet, at the following address:

[0010] http://www.w3.org/TR/2001/WD-soap 12-20010709.

[0011] Each information block in the XML language is defined between an opening tag and a closing tag, the information blocks thus being juxtaposed one after the other in the document, or nested inside one another.

[0012] Upon reception of a document, and especially when this document is relatively long, it is useful for the processing device to be able to process this document as it is being received, without having the whole of the document in memory at a given instant.

[0013] This aspect is all the more important for small-sized processing devices, such as a mobile telephone or a personal digital assistant, having a limited memory capacity.

[0014] Throughout the rest of this description, processing of a document on the fly is understood to mean a processing of this document which can be carried out as of the data constituting this document is being received, without having to store the whole of the document. This processing of the document on the fly is also called processing on the spot or streaming processing of the document.

[0015] However, the rules for processing a document may prohibit the option of this processing on the fly.

[0016] Thus, some of the information blocks may be marked by a particular attribute indicating that this block must mandatorily be processed during the processing of the document. Thus, the processing device should be configured to understand this information block marked with the particular attribute in order to be able to process the document as a whole.

[0017] Moreover, the SOAP standard specifies that the document processing device must actually understand all the blocks marked with this particular attribute before being able to start the processing of the document. This rule also requires the processing device to carry out a reading of the whole of the document before starting the processing of it, in order to verify its capability to be able to process all the blocks of information which are marked with the specific attribute. The processing device therefore has to be able to store the whole of the document in memory in order to carry out this first verification.

[0018] These rules for processing an XML document require that processing devices have a memory capacity sufficient for storing the whole of a document.

[0019] Furthermore, the first reading of the whole of the document, before the processing thereof, is costly in terms of time for processing this document.

[0020] Furthermore, it often happens that, in an XML document, certain information blocks reference one or more other information blocks, which are possibly placed before or after it in the document.

[0021] In this case, it may also be necessary to store certain information blocks in memory in order to allow the processing of subsequent information blocks of the document.

[0022] The object of the present invention is to resolve the abovementioned drawbacks and to allow processing on the fly of at least a part of a document comprising blocks of information.

[0023] To that end, the present invention, in a first aspect, envisages a method of scheduling of a document comprising juxtaposed blocks of information.

[0024] According to the invention, this scheduling method comprises the following steps:

[0025] dividing the information blocks into two groups,

[0026] a first group comprising information blocks that can be processed on the fly; and

[0027] a second group comprising the information blocks of said document not in said first group;

[0028] inserting the second group of information blocks;

[0029] inserting a signaling block; and

[0030] inserting the first group of information blocks after said signaling block.

[0031] The scheduling method thus makes it possible automatically to separate the information blocks which are suitable for being processed on the fly from the other information blocks.

[0032] By virtue of the incorporation of a signaling block, placed before the information blocks suitable for being processed on the fly, it is possible to indicate to a processing device the presence of such blocks, not requiring these blocks to be stored in memory in order to process them.

[0033] This scheduling method thus makes it possible to reduce the part of the document having to be processed globally, and thus necessarily being stored in memory, and makes it possible to allow processing of at least a part of it on the fly.

[0034] According to one preferred characteristic of this first aspect of the invention, the dividing step includes the following sub-steps:

[0035] identifying at least one information block associated with a predetermined attribute, said predetermined attribute indicating the mandatory processing of the information block at the moment of the processing of said document; and

[0036] writing said identified information block into said second group.

[0037] By virtue of this scheduling method, all the information blocks associated with a predetermined attribute, indicating the mandatory processing of these information blocks, are placed at the head of the document in such a way that the processing device can verify its capacity to process this type of information block as from reception of the start of the document, until the identification of the marking block.

[0038] According to an advantageous characteristic of this first aspect of the invention, the dividing step includes the following sub-steps:

[0039] identifying a first information block referencing a second information block; and

[0040] writing the first information block into said second group if the second information block belongs to said second group.

[0041] Thus there are grouped together into the second group of information blocks, which is placed at the header of the document, all the information blocks referencing an information block placed in this second group.

[0042] Alternatively, the dividing step of the scheduling method in accordance with the first aspect of the invention includes the following sub-steps:

[0043] identifying a first information block referencing a second information block; and

[0044] writing the first information block before the second information block if the second information block belongs to said first group.

[0045] Here, the first information block referencing the second information block is placed before this second information block in such a way that the processing of the document can be carried out on the fly as the information blocks are being received.

[0046] According to a second aspect of the invention, a method for processing a document comprising juxtaposed information blocks comprises the following steps:

[0047] identifying a predefined signaling block; and

[0048] processing, on the fly, the information blocks inserted after said predefined signaling block.

[0049] Thus, the processing method allows on-the-fly processing of part of a document as from the identification of a signaling block incorporated during the scheduling of the document as described above.

[0050] The present invention correspondingly relates to a device for scheduling a document comprising juxtaposed information blocks, comprising:

[0051] means for dividing information blocks into two groups,

[0052] a first group comprising information blocks that can be processed on the fly; and

[0053] a second group comprising the information blocks of said document not in said first group;

[0054] means for inserting the second group of information blocks;

[0055] means for inserting a signaling block; and

[0056] means for inserting the first group of information blocks after said signaling block.

[0057] It also relates to a device for processing a document comprising juxtaposed information blocks, comprising:

[0058] means for identifying a predefined signaling block; and

[0059] processing means configured to process, on the fly, information blocks inserted after said predefined signaling block.

[0060] These scheduling and processing devices exhibit advantages and characteristics similar to those of the methods which they implement.

[0061] According to another aspect of the invention, a method of creating a document that can be processed on the fly, where the document comprises juxtaposed information blocks, comprising the step of:

[0062] dividing the information blocks into a first group containing the information blocks that can be processed on the fly and a second group containing the information blocks not in said first group;

[0063] inserting at least one block from said second group into the document;

[0064] inserting a signaling block into the document after said one block from said second group; and

[0065] inserting at least one block from said first group after the signaling block.

[0066] According to another aspect of the invention, a computer document comprising juxtaposed blocks of information, comprises a signaling block, the information blocks inserted after said signaling block being able to be processed on the spot.

[0067] The present invention also relates, in a third aspect, to a method of generating a document adapted to be represented in the form of information blocks.

[0068] According to this third aspect of the invention, the generation method comprises the following steps:

[0069] identifying at least one reference associated with an information block, said reference being associated with a marker indicating that it is mandatory to process said information block during processing of the document;

[0070] creating an additional information block comprising a list of identified references; and

[0071] writing, at the beginning of the document, the additional information block, and the information blocks of the document after said additional information block.

[0072] The method of generating such a document thus makes it possible to identify, at the beginning of the document, all the information blocks it is mandatory to process during processing of the document.

[0073] Thus, the processing device can check it is capable of processing all the information blocks of the document simply by reading the first additional information block, without having to analyze the whole document first. The processing of such a document is therefore faster.

[0074] Furthermore, once this additional information block has been analyzed, all the information blocks of the document placed after this additional information block can be processed as the document is being received by the processing device.

[0075] According to a preferred characteristic of the third aspect of the invention, the identification step is implemented on an XML schema adapted to define the structure of an XML document.

[0076] Thus, during the generation of an XML document from an XML schema, it is possible to identify the information blocks associated with a predetermined marker directly in the XML schema, independently of the data and information incorporated subsequently in the generated document.

[0077] According to another advantageous characteristic of the third aspect of the invention, at the step of creating an additional information block, the references in the list consist of names of tags associated with the information blocks.

[0078] The information blocks included between an opening tag and a closing tag can thus be identified relatively simply by the actual name of this tag, when the document is represented in a markup language.

[0079] According to a fourth aspect of the invention, a method of processing a document comprising a first information block comprising a list of references of information blocks associated with a predetermined marker, and successive information blocks, comprises the following steps:

[0080] reading the first information block; and

[0081] checking, for each reference in said list, that the processing device is adapted to process the referenced information block.

[0082] Thus, checking that the processing method is capable of processing all the information blocks can be achieved simply by reading and analyzing the first information block, without requiring a complete reading of the document to be processed.

[0083] According to a preferred characteristic of this processing method, if the processing device is adapted to process all the information blocks associated respectively with references in the list, the method has a step of processing the information blocks of the document written after the first information block.

[0084] The information blocks of the document can thus be processed on the fly as soon as the first information block has been processed first.

[0085] According to another aspect of the invention, a document represented in a markup language, comprising information blocks defined between an opening tag and a closing tag, has an additional information block comprising a list of references of information blocks of said document, these referenced information blocks being associated with a marker indicating that it is mandatory to process the information block during processing of the document.

[0086] Such a document can be processed on the fly by a processing device, as soon as the additional information block has actually been processed by the processing device.

[0087] According to an advantageous characteristic of the invention, the additional information block is placed at the beginning of the document.

[0088] The whole of the document can thus be processed as it is being received, as soon as the additional information block has been processed in the first place by the processing device.

[0089] Correlatively, the present invention relates to a device for generating a document adapted to be represented in the form of information blocks.

[0090] According to the invention, the generation device comprises:

[0091] means for identifying at least one reference associated with an information block, said reference being associated with a marker indicating that it is mandatory to process said information block during processing of the document;

[0092] creation means adapted to create an additional information block comprising a list of identified references; and

[0093] writing means adapted to write, on the one hand, the additional information block at the beginning of the document and, on the other hand, information blocks of the document after said additional information block.

[0094] It also relates to a device for processing a document comprising a first information block comprising a list of references of information blocks associated with a predetermined marker, and successive information blocks.

[0095] This document processing device comprises:

[0096] means for reading the first information block; and

[0097] means for checking, for each reference in the list, that the processing device is adapted to process the referenced information block.

[0098] These generation and processing devices have advantages and characteristics similar to those of the methods implemented by them.

[0099] The present invention applies in particular to any document represented in XML language.

[0100] It also relates to a mobile telephone, a personal digital assistant and, more generally, any computer system including a scheduling device and/or a processing device in accordance with the invention.

[0101] It also relates to an information medium, possibly wholly or partly removable, which can be read by a computer system, containing instructions of a computer program able to implement a scheduling method, and/or a generation method and/or a processing methods in accordance with the invention, when this program is loaded and run by computer system.

[0102] Finally, it envisages a computer program stored on an information medium, the program including instructions suitable for implementing a scheduling method and/or a generation method and/or a processing methods in accordance with the invention, when it is loaded and run by a computer system.

[0103] This mobile telephone, this personal digital assistant, this computer system, this information medium and this computer program exhibit characteristics and advantages similar to the methods which they implement.

[0104] Other features and advantages of the invention will emerge further from the description below.

[0105] In the attached drawings, given by way of non-limiting examples:

[0106]FIG. 1 is an algorithm illustrating the scheduling method in accordance with one embodiment of the first aspect of the invention;

[0107]FIG. 1A is an algorithm illustrating a verification step of the scheduling method of FIG. 1;

[0108]FIG. 1B is an algorithm illustrating a sorting step of the scheduling method of FIG. 1;

[0109] FIGS. 2 to 5 are diagrammatic representations of an example document represented in a markup language, illustrating the scheduling of the document upon implementation of the scheduling method of FIG. 1;

[0110]FIG. 6 is an algorithm illustrating a method of processing a document in accordance with one embodiment of the second aspect of the invention;

[0111]FIG. 7 is an algorithm illustrating the generation method in accordance with one embodiment of the third aspect of the invention;

[0112]FIG. 8 is an algorithm illustrating a processing method in accordance with one embodiment of the fourth aspect of the invention; and

[0113]FIG. 9 illustrates schematically a computer system adapted to implement the various methods of the invention.

[0114] A method of scheduling a document in accordance with one embodiment of the first aspect of the invention will first of all be described by reference to FIG. 1.

[0115] A document in XML language, as represented diagrammatically in FIG. 2, will be considered here, in a manner which is not in any way limiting.

[0116] This document comprises several juxtaposed information blocks, here five information blocks.

[0117] In XML language, each information block is bounded by an opening tag and a closing tag and comprises a certain number of text data items.

[0118] Needless to say, each block of the document may also include children tags, and may do so recursively.

[0119] Here, the blocks in question are all situated at the same hierarchical level of the XML document, in such a way that they are juxtaposed, with no possible overlap between the various blocks.

[0120] Each opening tag of an information block of the document may also comprise an attribute making it possible to qualify this tag.

[0121] In particular, the blocks 1 and 3 are associated here with a predetermined attribute, suitable for indicating to a processing device that the understanding and processing of these information blocks 1 and 3 are mandatory during the processing of the document.

[0122] In XML language, such an attribute is called “mustUnderstand”, denoted in the remainder of this description as mU for short.

[0123] When this attribute is associated with the value “true”, the device for processing the document must actually be capable of processing this information block, denoted mU block.

[0124] Furthermore, the SOAP standard dictates that the processing device can process the other blocks of the document only if it is suitable for processing all the blocks associated with the attribute mU.

[0125] Moreover, a document in XML language may also include information blocks referencing other information blocks.

[0126] By way of example, the block 4 references the block 2, while the block 5 references the block 3.

[0127] The first block references a second block when the processing of the first block requires all or part of the data from the second block.

[0128] This is the case especially with a signature block of a digital image, which requires the data representative of the image which are stored in another block in order to calculate the signature.

[0129] The document, as illustrated in FIG. 2, may constitute a message, generated on a server station or a computer of a communications network. This message will then be transferred to a processing device incorporated, for example, in another computer of the communications network, or else in a mobile telephone or a personal digital assistant, with a view to processing of it.

[0130] As illustrated in FIG. 1, the first step E10 of obtaining the message to be sent is implemented on a server computer of the communications network.

[0131] The message, as illustrated in FIG. 2, is thus generated directly by the server computer of the network or else is recovered via the communications network from another computer.

[0132] Next, in accordance with the invention, the scheduling method first of all includes a step E11 of distributing information blocks into two groups.

[0133] This distribution step E11 makes it possible to store, in a first group, information blocks which are suitable for being processed on the fly, or else on the spot, as soon as they are received by the processing device.

[0134] The second group comprises the other information blocks of the document, that is to say the information blocks which cannot be processed on the fly as they arrive, but require at least one other information block to be held in memory in order to process them.

[0135] In the remainder of the description, the first group comprising information blocks suitable for being processed on the fly will be called group V and the second group, comprising the other information blocks, will be called group NV.

[0136] Here, in this preferred embodiment, the distribution step E11 first of all comprises a step E111 for the identification of the blocks on the basis of the previously described attribute mU.

[0137] In practice, each information block of the message is examined, and the information blocks associated with an attribute mU are identified.

[0138] For each information block of the message, the opening tag defining the start of the information block is read.

[0139] It is verified whether the attribute “mustUnderstand” exists and whether it is associated with a value “true”.

[0140] Thus the blocks of the message which are associated with an attribute mU the value of which is “true” are identified.

[0141] Here, the blocks 1 and 3 of the message are identified, as illustrated in FIG. 2.

[0142] These information blocks 1 and 3 thus identified are then written into the second group NV.

[0143]FIG. 3 illustrates this distribution of the information blocks of the message of FIG. 2 on completion of step E111.

[0144] A verification step E112 is then implemented and makes it possible to verify the references existing within the message to information blocks of the group NV.

[0145] This verification step E112 is illustrated in detail in FIG. 1A.

[0146] In practice, a first information block referencing a second information block is identified.

[0147] For example, the block 5 referencing the block 3 and the block 4 referencing the block 2 are identified here.

[0148] If the second information block belongs to the second group NV, the first information block is written into this second group NV.

[0149] This is the case here with the information block 5 which references the information block 3 belonging to the second group NV. This information block 5 is written into the second group NV following the information blocks 1 and 3, as illustrated in FIG. 4.

[0150] As illustrated in FIG. 1A, this verification step is implemented on all of the information blocks stored in the first group V on completion of the identification step E111.

[0151] An obtaining step E1 makes it possible to obtain the first information block of the first group V.

[0152] A test step E22 makes it possible to verify whether this first block references a block stored in the second group NV.

[0153] If yes, a shifting step E22 makes it possible to shift the current information block into the second group NV.

[0154] After this shifting step E23, the step E21 of obtaining the first block of the group V is reiterated so as to reiterate the whole of the verification algorithm whenever the second group NV has been modified by the addition of a supplementary block.

[0155] If, on completion of this test step E22, the first block does not reference a block stored in the second group NV, it is verified, in a test step E24, whether another block exists in the first group V.

[0156] If yes, an obtaining step E25 makes it possible to obtain the following block stored in the first group V and steps E22 to E25 are reiterated for this following block.

[0157] When all the blocks of the group V have been verified, the verification step E112 terminates with a negative response on completion of the test step E24.

[0158] After this verification step E112, a sorting step E113 is also implemented on all the information blocks of the first group V.

[0159] This sorting step E113 is illustrated in detail in FIG. 1B.

[0160] In particular, when a first information block is identified referencing a second information block in the first group V, this first information block is written before the second block in this first group V.

[0161] Here, the block 4 referencing the block 2 is placed before the block 2 as illustrated in FIG. 4.

[0162] During this sorting step E113, if at least two information blocks referencing one another directly or indirectly are identified, these information blocks are written into the second group NV.

[0163] Such a case can occur in particular when reference cycles are detected, that is to say, for example, when, with a first block referencing a second block and this second block referencing a third block, the third block itself references this first block.

[0164] All these blocks thus belong to the same cycle and should be stored in order to allow them to be processed by a processing device.

[0165] These blocks are also transferred as a whole into the second group NV.

[0166] In practice, as illustrated in FIG. 1B, the sorting algorithm commences by identifying all the blocks of the first group V not referencing any other block of this group.

[0167] To do that, an obtaining step E31 makes it possible to obtain the first information block of the group V.

[0168] It is verified, in a test step E32, whether this first block references another block of the group V.

[0169] If not, this block is marked with a mark equal to 1, in a marking step E33.

[0170] Then, in a step E34, the following block of group V is examined, if it exists.

[0171] An obtaining step E35 makes it possible to obtain this following block on which the steps E32 to E35 are reiterated.

[0172] If, on completion of the test step E32, the current block references another block, the algorithm passes directly to the following block of group V, without marking this block.

[0173] On completion of these steps E31 to E35, all the blocks not referencing any other block have been identified. These blocks are marked with the mark 1.

[0174] When all the blocks of the group V have been examined, the following steps of the sorting algorithm make it possible to climb back up the reference links from the previous identified blocks.

[0175] The algorithm consists in marking each block with a number of references to be traveled in order to go from this block as far as a block not referencing any other block.

[0176] Thus, in an initialization step E36, an index e is initialized at the value 1, and the number of blocks in the group V is associated with a second index n.

[0177] Then, in an obtaining step E37, the first information block of the group V is obtained.

[0178] It is verified, in a test step E38, whether this current block references an information block marked with the current index e.

[0179] If yes, the current block is itself marked with a mark equal to e+1 in a marking step E39.

[0180] It is verified, in a test step E40, whether another block exists in the group V, and the following block is obtained in an obtaining step E41.

[0181] The steps E38 to E41 are then reiterated on this following block.

[0182] If, on completion of the test step E38, the current block does not reference any block marked e, the following block in the first group V is considered directly.

[0183] When, on completion of the test step E40, all the blocks of the group V have been examined, the value of the index e is compared to a threshold value equal to 2n.

[0184] If this index value e is below 2n, an incrementation E43 is implemented in order to increment the value of the index e by one unit, and the set of steps E37 to E42 are reiterated over the whole of the information blocks of the group V.

[0185] Thus, these steps E37 to E42 make it possible to mark each block with the number of references.

[0186] By way of example, if a block B3 references B2, this block B2 itself referencing a block B1 which does not reference anything, then the block B3 is marked with an index equal to 3, the block B2 with an index equal to 2 and the block B1 with an index equal to 1.

[0187] Furthermore, this marking algorithm will also mark the blocks forming part of a cycle with a mark equal to a high number.

[0188] This is because, if a block B3 references a block B2 which itself references a block B1 which does not reference anything and if, furthermore, the block B2 also references the block B3, the marking algorithm described above will mark the block B1 with an index 1, then mark the block B2 with an index 2, then mark the block B3 with an index 3 then again mark the block B2 with an index 4 then the block B3 with an index 5, then the block B2 with an index 6.

[0189] By virtue of the test step E42, the marking steps E33 to E41 are implemented as long as the index e has not reached the value 2n corresponding to twice the number n of information blocks stored in the group V.

[0190] Thus, the blocks forming part of a cycle (that is to say the blocks referencing at least one another, directly or indirectly) will automatically be marked with a number which is sufficiently high, and least higher than the number n of information blocks stored in the group V.

[0191] Then, when these marking steps are terminated, the sorting is actually carried out.

[0192] A first transfer step E44 makes it possible to shift the unmarked information blocks into the second group NV.

[0193] These unmarked blocks are in fact blocks belonging to a cycle referencing themselves directly or indirectly, without any referencing to other blocks of the document.

[0194] A second transfer step E45 is implemented to shift all the blocks the marking index of which is strictly higher than the number n of information blocks in the group V.

[0195] Thus all the cycles are transferred into the second group NV.

[0196] The only information blocks stored in the group V on completion of the transfer steps E44 and E45 are blocks which do not reference any other block or which do not include any cross reference, direct or indirect, between two blocks.

[0197] A sorting step E46 is carried out on the blocks of the group V on the basis of the marks associated with each block, in decreasing marks.

[0198] The few examples which follow illustrate, in a way which is not at all limiting, the introduction of this sorting algorithm onto a set of three blocks, as a function of the referencing existing between these blocks.

EXAMPLE 1 B3 References B2 and B2 References B1

[0199] The marking of the blocks is as follows:

[0200] B3 is associated with 3,

[0201] B2 is associated with 2, and

[0202] B1 is associated with 1.

[0203] The blocks B1, B2, B3 remain in the first group V and are sorted in order B3, B2, B1.

EXAMPLE 2 B3 References B2, B3 References B1 and B2 References B1

[0204] The marking of the blocks is as follows:

[0205] B3 is associated with 3,

[0206] B2 is associated with 2, and

[0207] B1 is associated with 1.

[0208] In this case also, the set of blocks remains in the first group V and is sorted into order B3, B2, B1.

EXAMPLE 3 B3 References B2, B2 References B1 and B1 References B3

[0209] These blocks are not marked on completion of the marking algorithm, such that all these blocks are shifted into the second group NV, during the transfer step E44.

EXAMPLE 4 B3 References B2, B2 References B1 and B2 References B3

[0210] B3 is associated with 5,

[0211] B2 is associated with 6, and

[0212] B1 is associated with 1.

[0213] In this example, the blocks B3 and B2 are shifted into the second group NV on completion of the transfer step E45, the block B1 being kept in the first group V.

[0214] Hence, on completion of this distribution step E11, a document is obtained distributed into two groups of information blocks V and NV, as illustrated in FIG. 4, between those capable of being processed on the fly and those not being capable of being processed on the fly.

[0215] In one preferred mode of the invention, the distribution step E11 may further include a step E114 of verification of the action of each block on the internal state of a processing device.

[0216] In practice, it is verified, for the set of information blocks stored in the second group NV, and more particularly the information blocks associated with the attribute mU, whether the processing of these information blocks is capable of modifying the internal state of the computer system incorporating a device for processing this document.

[0217] This verification can be carried out with the aid of a table storing the name of the opening markers of each block and their capacity to modify or not modify the internal state of the processing device.

[0218] If none of these information blocks are suitable for modifying the internal state of the computer system, this set of information blocks is transferred from the second group NV into the first group V.

[0219] These information blocks are sorted beforehand according to the same sorting algorithm as that described above by reference to FIG. 1B. All these blocks are then inserted at the start of the first group V on completion of the verification step E114.

[0220] Likewise, if a single block of the second group NV corresponds to a processing likely to modify the internal state of the computer system incorporating the device for processing the message, and if this block makes no reference to any other block of the second group NV, the set of information blocks of the group NV can also be transferred from this second group NV into the first group V.

[0221] The information blocks of the group NV are sorted beforehand, as described above by reference to FIG. 1B.

[0222] The block the processing of which is likely to modify the internal state of the computer system is placed at the end of this second group NV, then the set of blocks of this second group NV is inserted at the start of the first group V, on completion of the verification step E114.

[0223] This verification step E114 thus makes it possible to place the information blocks in the first group V if at the very most one of these information blocks is capable of modifying the internal state of the computer system.

[0224] It is possible, in fact, to process these information blocks and to stop the processing of the message as a whole if one of these information blocks is not understood by the processing device, without in any way having modified the internal state of the computer system, in such a way that, upon the interruption to the procedure for processing the message, the latter appears not to have been processed by the processing device.

[0225] All these steps for dividing the blocks make it possible to place the information blocks in the first group V as much as possible, in such a way that they can be processed on the fly. This algorithm for separating the information blocks thus makes it possible to minimize the memory space required to process the message.

[0226] After this distribution, a creation step E12 is then implemented in order to generate a new message in which the information blocks are scheduled in accordance with the scheduling method of the invention.

[0227] In this new message, during an inserting step E13, the second group NV of information blocks, that is to say the set of information blocks having to be processed globally by the processing device, is inserted first of all.

[0228] An inserting step E14 is then implemented in order to insert a signaling block into the document forming a separator between the two groups V and NV.

[0229] Next, in an inserting step E15, the first group V of information blocks is inserted directly after the signaling block.

[0230] The new message thus created on completion of the scheduling method in accordance with this embodiment is illustrated in FIG. 5.

[0231] When this message has to be processed by a processing device of the network, this message is sent in a sending step E16.

[0232] A method of processing a document represented in a markup language in accordance with the second aspect of the invention will now be described, by reference to FIG. 6.

[0233] By way of example, the method of processing a message, as illustrated in FIG. 5, will be described, that is to say a message in which the information blocks have been scheduled in accordance with the scheduling method of the invention.

[0234] Thus, a receiving step E60 is implemented so as to receive the is start of the message to be processed.

[0235] A step E61 of receiving a first block is then implemented in order to examine the information blocks one by one.

[0236] It is first of all verified, in a test step E62, whether this received block forms the end of the message.

[0237] If not, it is verified, in a second test step E63, whether the information block received is a predefined signaling block, indicating that the information blocks situated in the message after this marking block can be processed on the fly.

[0238] If not, the step E61 of receiving the following information block of the message is implemented, and this is done recursively as long as the information block does not correspond to the predefined signaling block.

[0239] Thus, in practice, all the information blocks of the second group NV placed at the header of the message are received.

[0240] Thus, by reference to FIG. 5, the blocks 1, 3 and 5 of the message are received, which are stored in memory with a view to their subsequent processing by the processing device.

[0241] When the received block is the predefined signaling block, that is to say here the separator block placed between the groups NV and V, a processing step E64 makes it possible to process the information blocks stored by the processing device.

[0242] Thus, the set of blocks received previously corresponding to the group NV of information blocks is processed globally, in a conventional way by a device for processing an XML document.

[0243] In particular, the set of these information blocks is traversed a first time by the processing device so as to verify whether the latter is suitable for processing all the information blocks bearing the attribute “mustUnderstand”.

[0244] If one or more information blocks bearing the attributes mU is not understood by the processing device, the processing of the message as a whole is stopped and an error message is generally sent to the computer having sent the message.

[0245] Otherwise, the set of blocks of the second group NV is processed globally by the processing device.

[0246] Then, in accordance with the invention, as soon as the identification of the predefined signaling block has been carried out at the test step E63, a processing step E65 is implemented in order to process on the fly the information blocks inserted after this predefined signaling block.

[0247] Here, the set of blocks 4 and 2 are thus processed, in the order in which they were stored in the first group V of the message as illustrated in FIG. 5.

[0248] The end of the message is thus processed in the data stream, as and when the information blocks are received by the processing device.

[0249] Needless to say, the message received may possibly not include any signaling block. This is the case especially if the client computer having generated the message does not implement the invention, or else when all the information blocks are stored in the second group NV (or, in other words, the first group V is empty).

[0250] In this case, during the processing of the message, the steps E61 to E63 are implemented in a recurrent way. When, on completion of the test step E62, the end of the message is detected, a processing step E66 is implemented in order to process globally the message thus stored in its entirety.

[0251] It will be noted, moreover, that the signaling block indicating that the rest of the message can be processed on the fly, is not a block associated with the attribute “mustUnderstand”. Thus, a processing device not implementing the processing method in accordance with the second aspect of the invention is nevertheless capable of processing the message sent by a server computer implementing the invention, in which a signaling block has been inserted between the two groups V and NV. It is sufficient for it to ignore the marking block.

[0252] This method of processing an XML document can advantageously be implemented directly in a mobile telephone or else in a personal digital assistant such as an on-line diary.

[0253] The device for scheduling the XML document is itself to be incorporated into a station of a communications network configured to communicate with a mobile telephone or a personal digital assistant.

[0254] By virtue of the incorporation of a signaling block indicating the presence of information blocks capable of being processed in streaming mode in the message, the processing device can process long messages, without requiring a substantial memory space for storing the whole of the message.

[0255] When creating such a document comprising several blocks of information, during the inserting steps E13, E15, at least one block of the second group NV and at least one block of the first group V can be inserted respectively before and after the signaling block.

[0256] There will be described now, with reference to FIG. 7, a document generation method in accordance with one embodiment of a third aspect of the invention.

[0257] As previously, the document to be generated is a document represented in a markup language of the XML type.

[0258] Such an XML document thus comes in the form of a message usable by a communication protocol implemented on a network between computers or other communication devices.

[0259] This XML document or message comprises a number of information blocks, each information block being delimited by an opening tag and a closing tag and comprising a number of textual data items.

[0260] By way of example, a message represented in this way in the XML language is given below: < ?xml version=“1.0” ?> <message> <rotate> <image>jjm.jpeg</image> <angle>90</angle> </rotate> <ns:decompress mustUnderstand=“true” xmlns:ns=“http://canon.fr”> <image>jjm.gif.gz</image> </decompress> <resize> <coefficient>4</ coefficient > </resize> </message>

[0261] In this example, the message has three information blocks, respectively delimited by the tags “rotate”, “decompress” and “resize”.

[0262] The tag “decompress” is furthermore associated with a name-space “ns” identified by an Internet address, for example http://canon.fr, making it possible to uniquely define the tag “decompress”.

[0263] One or more information blocks of the XML message can be associated with the marker called “mustUnderstand” this marker indicating that it is mandatory to process the information block during processing of the document.

[0264] In the example XML message described previously, the predetermined marker is an mU attribute associated with the opening tag “decompress” of the second information block of the message.

[0265] Of course, other ways of associating this marker with a block can be used.

[0266] Thus, the marker can be a tag included in an information block.

[0267] The document would then appear as follows: <block> <mustUnderstand value=“true”/> . . . </block>

[0268] Alternatively, the marker can also be a tag defining an information block itself included in this tag.

[0269] In this case, the document would appear as follows: <mustUnderstand value=“true”/> <block> . . . <block> </mustUnderstand>

[0270] Whatever the representation chosen, it makes it possible to associate, with an information block, a marker “mustUnderstand” indicating that it is mandatory to process this information block during processing of the document.

[0271] As illustrated in FIG. 7, during generation of the document, at least one reference associated with an information block will be identified, this reference being associated with the predetermined marker, here the marker “mustUnderstand”.

[0272] This identification step can be carried out on the XML document already created or else at the actual time of generating the XML document.

[0273] Here, this identification step is implemented on an XML schema adapted to define the structure of the XML document it is wished to generate subsequently.

[0274] In fact, there can be associated, with an XML document, an XML schema that, itself written in XML language, defines the type structure of a document, that is to say the name of the tags used in this document, their attribute, and the type of values taken by the tags or the attributes.

[0275] By way of example, an XML schema corresponding to the XML document described previously would be as follows: <xs:schema targetNamespace=“http://canon.fr”> <xs:element name=“message”> <xs:complexType> <xs:element name=“rotate”> <xs:complexType> <xs:element name=“image” type=“xsi:anyURI”/> <xs:element name=“angle” type=“xsi:integer”/> </xs:complexType> </xs:element> <xs:element name=“decompress”> <xs:complexType> <xs:attribute name=“mustUnderstand” type=“xsi:boolean” value=“true”/> <xs:element name=“image” type=“xsi:anyURI/> </xs:complexType> </xs:element> <xs:element name=“resize”> <xs:complexType> <xs:element name“coefficient” type=“xsi:integer”/> </xs:complexType> </xs:element> <xs:complexType> </xs:schema>

[0276] In practice, the message generation method will have a first step of choosing E70 a message type, for example from a set of stored XML schemas.

[0277] From the chosen XML schema, an identification step E71 identifies the references of the information blocks associated with a “mustUnderstand” attribute.

[0278] In practice, in the XML schema described previously, there will be identified the tag <xs:element name=“decompress”>associated with the attribute “mustUnderstand”, the value of which is “true”.

[0279] The reference thus identified can consist of the name of the tag “decompress” associated with this information block.

[0280] Advantageously, this reference can comprise, in XML language, not only the name of the tag but also its associated namespace, thus making it possible to uniquely define the identified tag.

[0281] Here, from the XML schema, the namespace and the name of the tag to be written into the list of references would be “ns:decompress”.

[0282] A creation step E72 is next implemented in order to create an additional information block L. This block consists of the list of references identified previously.

[0283] Of course, although a single reference was identified in the example described previously, this list can comprise a number of references.

[0284] Furthermore, this list can also be empty.

[0285] A writing step E74 next writes this additional information block L at the beginning of the message to be generated, and then writes the other information blocks of the document after this additional information block L.

[0286] In practice, a test step E75 checks whether this list L is non-empty.

[0287] If this list L is empty, the creation step E74 continues with the writing of the message in a conventional manner, that is to say the writing of all the information blocks in the XML language, using the opening and closing tags defining the information blocks.

[0288] This writing of the XML document from a predetermined XML schema does not need to be described in more detail here.

[0289] On the contrary, if the additional information block L contains at least one reference, there is written, in a step E76, an opening tag defining the start of the additional block to be written:

[0290] <mustUnderstand>

[0291] There is next selected, in a selection step E77, the first reference stored in the additional information block L.

[0292] Here, this first reference is the name of the tag “decompress”.

[0293] A reading step E78 reads the name “name” of the tag.

[0294] A writing step E79 next writes, in a conventional manner, the name of this tag in the information block “mustUnderstand”:

[0295] <name/>

[0296] A check is made, in a test step E80, as to whether this current tag is the last tag in the block L.

[0297] If the answer is no, the next tag in the additional information block L is selected in a selection step E81, and the set of steps E78 to E80 is reiterated for this tag.

[0298] When all the tags in the block L have been examined and written, a writing step E82 writes the closing tag of the additional information block, in the form:

[0299] </mustUnderstand>

[0300] This additional information block thus lists all the names of the tags associated with an information block comprising the attribute “mustUnderstand”.

[0301] A writing step E83 is then implemented in order to write, after this additional information block L, all the information blocks constituting the document to be generated.

[0302] By way of example, the XML document described previously appears in the following form, after implementation of the generation method in accordance with the invention: < ?xml version=“1.0” ?> <message> <mustUnderstand> <decompress/> </mustUnderstand> <rotate> <image>jjm.jpeg</image> <angle>90</angle> </rotate> <ns:decompress mustUnderstand=“true” xmlns:ns=“http://canon.fr”> <image>jjm.gif.gz</image> </decompress> <resize> <coefficient>4</ coefficient> </resize> </message>

[0303] This message thus appears in the form of a document comprising information blocks, a first information block comprising a list of references of information blocks of the document, these referenced information blocks being associated with a marker indicating that it is mandatory to process the information block during processing of the document.

[0304] The message thus generated on a server station or a computer on a communication network is next transferred to a processing device incorporated for example in another computer on the communication network, or else in a mobile telephone or a personal digital assistant, with a view to the processing thereof.

[0305] There will now be described, with reference to FIG. 8, the processing of such a message generated by the generation method in accordance with the fourth aspect of the invention.

[0306] A receiving step E90 thus first of all receives the message to be processed.

[0307] A reading step E91 consists of reading the first information block received.

[0308] It may be noted in this respect that the message can be received and processed block by block, in order to minimize the memory space necessary for processing the whole of the message.

[0309] A check is made, in a test step E92, as to whether this first block is a “mustUnderstand” block, that is to say whether it corresponds to the additional information block added during generation of the message.

[0310] If the answer is no, a step E93 lists all the blocks to be processed of the message, that is to say here, all the blocks of the message.

[0311] A processing step proper E94 is implemented in a conventional manner on these information blocks of the message.

[0312] If, at the end of the test step E92, the first information block received is indeed a “mustUnderstand” block, a check is made, for each reference stored in this block, that the processing device is indeed adapted to process the information block corresponding to this reference.

[0313] For this, there is selected, in a selection step E95, the first child of this “mustUnderstand” block, that is to say here, the first tag name stored.

[0314] Here, the tag <decompress/> is selected.

[0315] A reading step E96 reads the value “decompress”.

[0316] A test step E97 checks whether this tag is indeed known to the processing device, and in particular whether said device is adapted to process said tag.

[0317] This test step can be implemented from a table B storing all the tag names that the processing device is adapted to process.

[0318] When the tag read at the reading step E96 is not known to the processing device, at the end of the test step E97, a step of generating E98 and sending E99 an error indicates that the processing device is not adapted to process the received message.

[0319] This error message can be sent to the server device that generated and transferred the message, or else even appear on a screen of the processing device, when the latter for example is a mobile telephone, in order to indicate to the user that it was impossible to process the received message.

[0320] If, at the end of the test step E97, the current tag read is indeed known to the processing device, a check is made, in a test step E100, as to whether the selected child is the last in the “mustUnderstand” block.

[0321] If the answer is no, the next child is selected in a selection step E101, and the steps E96 to E100 are reiterated on this child.

[0322] When, at the end of the test step E100, all the children in the “mustUnderstand” block have been processed, there are identified, in an identification step E102, all the blocks of the message to be processed, that is to say here, all the blocks of the message except the first additional block already analyzed.

[0323] A processing step E104 can then be implemented in a conventional manner on these blocks to be processed identified at the identification step E102, without having to read all these blocks in order to check that the processing device is indeed adapted to process them.

[0324] By virtue of the invention, the processing of the information blocks of the document can thus be carried out as they are being read, as soon as the additional information block, placed at the beginning of the message, has been checked as described previously.

[0325] Conventionally, this processing method can include a test step E103 for checking whether the processing of the document produces a result. If the answer is yes, a sending step E104 sends this result by means of the computer that transferred the message or else displays this result for the user of the processing device.

[0326] One or other of these computer systems suitable for implementing the scheduling, the creating, the generation and/or processing methods in accordance with the invention is illustrated diagrammatically in FIG. 9.

[0327] The scheduling device, the generation device, and the processing devices according to the second or fourth aspect of the invention on the other hand, can be incorporated into a microprocessor 100, a read-only memory or ROM 101 comprising a program for scheduling a document, generating a document or processing documents, and a random-access memory or RAM 102 including registers configured to store variables modified in the course of the running of the program.

[0328] In particular, the random-access memory 102 of the scheduling device is configured to store all the blocks of the message as well as the indices e and n which are necessary for the sorting of the information blocks in the first group V.

[0329] Likewise, the random-access memory 102 of the processing device according to the second aspect of the invention is sufficient for storing all the information blocks received before the reception of the signaling block indicating the possibility of processing the following blocks on the fly as they are received, without having to store them in memory.

[0330] In document processing device in accordance with the fourth aspect of the invention, the random access memory 102 comprises registers adapted to store the first block of the document as well as the table B listing all the information blocks known to the processing device.

[0331] Alternatively, the document generation device has a random access memory 102 comprising registers adapted to store the list L of references of identified information blocks for creating the additional information block to be inserted at the beginning of the message.

[0332] This microprocessor 100 is integrated with a computer 10 which can be connected to various peripheral devices or else be incorporated in a mobile telephone, or else in a personal digital assistant (PDA) such as a connected organizer.

[0333] This computer 10 includes a communication interface 1 10 linked to the communications network 1 in order to receive or transmit documents such as messages written in XML language.

[0334] The computer 10 further includes document-storage means, such as a hard disk 106, or is configured to co-operate by means of a disk drive 107 (diskettes, compact discs or computer cards) with removable document-storage means, such as discs 700.

[0335] These fixed or removable storage means may further include the code of the scheduling or processing method in accordance with the invention which, once read by the microprocessor 100, will be held on the hard disk 106.

[0336] By way of a variant, the program allowing the scheduling, the generation or processing device to implement the invention may be stored in the read-only memory ROM 101.

[0337] In a second variant, the program may be received so as to be held as described above by way of the communication network 1.

[0338] The computer 10 also comprises a screen 103 allowing it, for example, to serve as interface with an operator by the use of the keyboard 104 or of the mouse 105 or of any other means, and to display data of the XML document after it has been processed.

[0339] The central-processing unit (CPU) 100 will execute the instructions relating to the implementation of the invention. When power is applied, the programs and methods relating to the invention held in a non-volatile memory, for example the read-only memory 101, are transferred into the random-access memory 102 which will then contain the executable code of the invention as well as the variables necessary for the implementation of the invention.

[0340] The communication bus 112 allows communication between the various sub-elements of the computer 10 or those linked to it. The representation of the bus 112 is not limiting, and, in particular, the microprocessor 100 is capable of communicating instructions to any sub-element directly or by way of another sub-element.

[0341] Needless to say, numerous modifications can be applied to the embodiment described above without departing from the scope of the invention.

[0342] Thus, although the scheduling method described above is implemented on a document already represented in XML language, this scheduling method can also be implemented in order to generate a document in XML language, even during its creation.

[0343] Furthermore, the association of the attribute mU with an information block may take place not only by way of an attribute associated with an opening tag defining the information block, as described in the embodiment, but also by virtue of a tag included in the information block or else by virtue of an encompassing tag, in which the information block is included.

[0344] The generation method has been described in its implementation from an XML schema used for generating an XML document.

[0345] This generation method could also be implemented on a representation in the form of computer objects or blocks of the document to be generated subsequently.

[0346] This representation can be made in the form of a tree, listing the different blocks and their respective hierarchical position, or else in the form of a table.

[0347] By way of example, the following table, corresponding to the XML document of the preceding example, could be used for identifying the references to be written into the additional information block. Name Block rotate B1 decompress B2 resize B3 B1 Name Value Type image jjm.jpeg tag angle 90 tag B2 Name Value Type image jjm.gif.gz tag mustUnderstand true attribute B3 Name Value Type coefficient  4 tag

[0348] To each block B1, B2 and B3 there corresponds a table referencing the tags and attributes of this block.

[0349] The identification step can be implemented from these tables, by identifying the blocks, here the block B2 (“decompress”), associated with the particular attribute “mustUnderstand”.

[0350] In a general manner, the present invention relates to any document comprising several blocks of information and it is not limited to document represented in a markup language. 

1. A method of scheduling of a document comprising juxtaposed blocks of information, which comprises the following steps: dividing (E11) the information blocks into two groups, a first group (V) comprising information blocks that can be processed on the fly; and a second group (NV) comprising the information blocks of said document not in said first group (V); inserting (E13) the second group of information blocks (NV); inserting (E14) a signaling block; and inserting (E15) the first group (V) of information blocks after said signaling block.
 2. The scheduling method as claimed in claim 1, wherein the dividing step includes the following sub-steps: identifying (E111) at least one information block associated with a predetermined attribute (mU), said predetermined attribute (mU) indicating the mandatory processing of the information block at the moment of the processing of said document; and writing (E111) said identified information block into said second group (NV).
 3. The scheduling method as claimed in claim 2, wherein the dividing step further includes the following steps: verifying (E114) the set of information blocks associated with said predetermined attribute (mU) whether the processing of said information blocks is suitable for modifying the internal state of a computer system incorporating a device for processing said document; and transferring (E114) said set of information blocks associated with said predetermined attribute (mU) of said second group (NV) into said first group (V) if the processing of at most one of said information blocks is suitable for modifying the internal state of said computer system.
 4. The scheduling method as claimed in claim 1, wherein the dividing step includes the following sub-steps: identifying (E112) a first information block referencing a second information block; and writing (E112) the first information block into said second group (NV) if the second information block belongs to said second group (NV).
 5. The scheduling method as claimed in claim 1, wherein then dividing step includes the following sub-steps: identifying (E113) a first information block referencing a second information block; and writing (E113) the first information block before the second information block if the second information block belongs to said first group (V).
 6. The scheduling method as claimed in claim 1, wherein the dividing step includes the following sub-steps: identification (E113) of at least two information blocks referencing one another, directly or indirectly; and writing (E113) said information blocks into said second group (NV).
 7. A method for processing a document comprising juxtaposed information blocks, which comprises the following steps: identifying (E63) a predefined signaling block; and processing (E65), on the fly, the information blocks inserted after said predefined signaling block.
 8. The method of processing a document as claimed in claim 7, which comprises the following steps: storing (E61) the information blocks of the document which are inserted before a predefined signaling block; identifying (E63) the predefined signaling block; processing (E64) the stored information blocks; and processing (E65) on the fly the information blocks inserted after said predefined signaling block.
 9. A device for scheduling a document comprising juxtaposed information blocks, comprising: means (100, 101, 102) for dividing information blocks into two groups, a first group (V) comprising information blocks that can be processed on the fly; and a second group (NV) comprising the information blocks of said document not in said first group; means (100, 101, 102) for inserting the second group (NV) of information blocks; means (100, 101, 102) for inserting a signaling block; and means (100, 101, 102) for inserting the first group (V) of information blocks after said signaling block.
 10. The scheduling device as claimed in claim 9, wherein the dividing means comprise: means (100, 101, 102) for identifying at least one information block associated with a predetermined attribute (mU), said predetermined attribute (mU) indicating the mandatory processing of the information block at the moment of the processing of said document; and means (100, 101, 102) for writing said identified information block into said second group (NV).
 11. The scheduling device as claimed in claim 10, wherein the dividing means (100, 101, 102) further comprise: means (100, 101, 102) for verification for the set of information blocks associated with said predetermined attribute (mU) whether the processing of said information blocks is suitable for modifying the internal state of a computer system incorporating a device for processing said document; and means (100, 101, 102) for transfer of said set of information blocks associated with said predetermined attribute (mU) of said second group (NV) into said first group (V) if the processing of at most one of said information blocks is suitable for modifying the internal state of said computer system.
 12. The scheduling device as claimed in claim 9, wherein the dividing means comprise: means (100, 101, 102) for identification of a first information block referencing a second information block; and means (100, 101, 102) suitable for writing the first information block into said second group (NV) if the second information block belongs to said second group (NV), or suitable for writing the first information block before the second information block if the second information block belongs to said first group (V).
 13. A device for processing a document comprising juxtaposed information blocks, which comprises: means (100, 101, 102) for identifying a predefined signaling block; and processing means (100, 101, 102) configured to process, on the fly, information blocks inserted after said predefined signaling block.
 14. The device for processing a document as claimed in claim 13, which further comprises: means (100, 101, 102) for storage of the information blocks of the document inserted before a predefined signaling block.
 15. The scheduling device as claimed in claim 9, which is incorporated into: a microprocessor (100); a read-only memory (101) adapted to store a program for scheduling a document; and a random-access memory (102) including registers adapted to store the variables modified during execution of said program.
 16. The processing device as claimed in claim 13, which is incorporated in: a microprocessor (100); a read-only memory (101) adapted to store a program for processing a document; and a random-access memory (102) including registers adapted to store the variables modified during the execution of said program.
 17. A method of creating a document that can be processed on the fly, where the document comprises juxtaposed information blocks, comprising the step of: dividing the information blocks into a first group containing the information blocks that can be processed on the fly and a second group containing the information blocks not in said first group; inserting at least one block from said second group into the document; inserting a signaling block into the document after said one block from said second group; and inserting at least one block from said first group after the signaling block.
 18. A mobile telephone, which includes a scheduling device as claimed in claim
 9. 19. A personal digital assistant, which includes a scheduling device as claimed in claim
 9. 20. A computer system, which includes a scheduling device as claimed in claim
 9. 21. A mobile telephone, which includes a processing device as claimed in claim
 13. 22. A personal digital assistant, which includes a processing device as claimed in claim
 13. 23. A computer system, which includes a processing device as claimed in claim
 13. 24. An information medium, possibly wholly or partly removable, readable by a computer system, which contains instructions for a computer program adapted to implement a scheduling method as claimed in claim 1, when this program is loaded and executed by computer system.
 25. An information medium, possibly wholly or partly removable, readable by a computer system, which contains instructions for a computer program adapted to implement a processing method as claimed in claim 7, when this program is loaded and executed by computer system.
 26. A computer program stored on an information medium, said program having instructions adapted to implement a scheduling method as claimed in claim 1, when it is loaded and executed by a computer system.
 27. A computer program stored on an information medium, said program having instructions adapted to implement a processing method as claimed in claim 7, when it is loaded and executed by a computer system.
 28. A computer document comprising juxtaposed blocks of information, wherein the computer document comprises a signaling block, the information blocks inserted after said signaling block being able to processed on the spot.
 29. Method of generating a document adapted to be represented in the form of information blocks, the method comprising the following steps: identifying (E71) at least one reference associated with an information block, said reference being associated with a marker (mU) indicating that it is mandatory to process said information block during processing of the document; creating (E72) an additional information block (L), comprising is a list of identified references; and writing (E74), at the beginning of the document, the additional information block (L), and the information blocks of the document after said additional information block (L).
 30. Generation method as claimed in claim 29, wherein, at the identification step (E71), the predetermined marker is an attribute (mU) associated with a tag of an information block.
 31. Generation method as claimed in claim 29, wherein, at the identification step (E71), the marker (mU) is a tag included in an information block.
 32. Generation method as claimed in claim 29, wherein, at the identification step (E71), the marker (mU) is a tag defining an information block.
 33. Generation method as claimed in claim 29, wherein the identification step (E71) is implemented on an XML schema adapted to define the structure of an XML document.
 34. Generation method as claimed in claim 29, wherein, at the step of creating (E72) an additional information block (L), said references in the list consist of names of tags associated with said information blocks.
 35. Method of processing a document comprising a first information block comprising a list of references of information blocks associated with a predetermined marker (mU), and successive information blocks, this method comprising the following steps: reading (E91) the first information block; and checking (E95-E101), for each reference in said list, that the processing device is adapted to process the referenced information block.
 36. Processing method as claimed in claim 35, this method having, if the processing device is adapted to process all the information blocks associated respectively with references in said list, a step of processing (E102, E94) the information blocks of the document written after said first information block.
 37. Device for generating a document adapted to be represented in the form of information blocks, the device comprising: means for identifying (100, 101, 102) at least one reference associated with an information block, said reference being associated with a marker (mU) indicating that it is mandatory to process said information block during processing of the document; creation means (100, 101, 102) adapted to create an additional information block (L), comprising a list of identified references; and writing means (100, 101, 102) adapted to write, on the one hand, the additional information block (L) at the beginning of the document and, on the other hand, the information blocks of the document after said additional information block (L).
 38. Device for processing a document comprising a first information block comprising a list of references of information blocks associated with a predetermined marker, and successive information blocks, this device comprising: means for reading (100, 101, 102) the first information block; and means for checking (100, 101, 102), for each reference in said list, that the processing device is adapted to process the referenced information block.
 39. Document processing device as claimed in claim 38, this device furthermore comprising means for processing (100, 101, 102) the information blocks of the document, written after said first information block.
 40. Generation device as claimed in claim 37, the device being incorporated in: a microprocessor (100); a read only memory (101) adapted to store a program for generating a document; and a random access memory (102) including registers adapted to store the variables modified during execution of said program.
 41. Processing device as claimed in claim 38, which is incorporated in: a microprocessor (100); a read only memory (101) adapted to store a program for processing a document; and a random access memory (102) including registers adapted to store the variables modified during execution of said program.
 42. Mobile telephone, which includes a generation device as claimed in claim
 37. 43. Personal digital assistant, which includes generation device as claimed in claim
 37. 44. Computer system, which includes a generation device as claimed in claim
 37. 45. Mobile telephone, which includes a processing device as claimed in claim
 38. 46. Personal digital assistant, which includes a processing device as claimed in claim
 38. 47. Computer system, which includes a processing device as claimed in claim
 38. 48. Information medium, possibly totally or partially removable, readable by a computer system, which contains instructions for a computer program adapted to implement a generating method as claimed in claim 29, when this program is loaded and run by a computer system.
 49. Information medium, possibly totally or partially removable, readable by a computer system, which contains instructions for a computer program adapted to implement a processing method as claimed in claim 35, when this program is loaded and run by a computer system.
 50. Computer program stored on an information medium, said program having instructions adapted to implement a generating method as claimed in claim 29, when it is loaded and run by a computer system.
 51. Computer program stored on an information medium, said program having instructions adapted to implement a processing method as claimed in claim 35, when it is loaded and run by a computer system.
 52. Document represented in a markup language, comprising information blocks defined between an opening tag and a closing tag, the document having an additional information block comprising a list of references of information blocks of said document, said referenced information blocks being associated with a marker indicating that it is mandatory to process the information block during processing of the document.
 53. Document as claimed in claim 52, wherein said additional information block is placed at the beginning of the document. 